int stock_fee::maxGetstock(vector<int>& prices, int fee)
{
	int n = prices.size();
	vector<vector<int>>dp(n, vector<int>(2));
	//初始化
	dp[0][0] = 0;
	dp[0][1] = -prices[0] - fee;

	//0代表手里没有票,1代表手里有票
	for (int i = 1; i < n; i++)
	{
		dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]+prices[i]);//可以保持或者把票卖掉
		dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - (prices[i] + fee));//可以买也可以不卖
	}

	return max(dp[n - 1][0], dp[n-1][1]);  
}
